Evaluating Associativity in CPU Caches
نویسندگان
چکیده
منابع مشابه
A New Case for Skewed-Associativity
Skewed-associative caches have been shown to statisticaly exhibit lower miss ratios than set-associative caches at equal associativity degrees. But for L1 caches, the performance of a four-way set-associative cache is known to be quite close to that of a 16-way set-associative cache. In this paper, we rst show that BTBs and L2 caches featuring long line size may beneet a lot from a high associa...
متن کاملAbout Cache Associativity in Low-Cost Shared Memory Multi-Microprocessors
Architecturesparalì eles, bases de données, réseaux et systèmes distribués About cache associativity in low-cost shared memory multi-microprocessors Abstract: In 1993, sizes of on-chip caches on current commercial microprocessors range from 16K bytes to 36 Kbytes. These microprocessors can be directly used in the design of a low cost single-bus shared memory multiprocessors without using any se...
متن کاملImproving Cache Power EÆciency with an Asymmetric Set-Associative Cache
Data caches are widely used in general-purpose processors as a means to hide long memory latencies. Set-associativity in these caches helps programs avoid performance problems due to cache mapping con icts. Many programs, however, need high associativity for only some of their frequently-referenced addresses and tolerate much lower associativity for the remainder of the references. With this va...
متن کاملQuantitative study of data caches on a multistreamed architecture
In this paper, we quantify the effect that fine grained multistreamed interaction of threads within a shared cache has on the miss rate. By concentrating on the miss rate, we focus on just the cache performance and separate ourselves from a given system architecture. We show the effects of cache capacity, associativity, and line size on the miss rates of multistreamed workloads of two, three an...
متن کاملAnalysis of Sub-block Placement and Victim Caching Techniques
Rapid advances in computer technology have led to the development of processors with peak performances of the order of GHz. Since it is not feasible to have unlimited fast-memory, the performance of these processors is handicapped if the performance of the memory-hierarchy is poor. Caching techniques have been developed with this in mind. This paper presents the analysis of the performance of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 38 شماره
صفحات -
تاریخ انتشار 1989